package basic.使用最小花费爬楼梯;

/**
 * @author zhengTao
 * @version 1.0
 * @description: 使用最小花费爬楼梯
 * @date 2022/11/27 16:34
 */
public class Demo746 {
    public static void main(String[] args) {
        int[] cost={10,15,20};
        int i = minCostClimbingStairs(cost);
        System.out.println(i);

    }
    public static int minCostClimbingStairs(int[] cost) {
        int[] dp=new int[cost.length+1];
        dp[0]=0;
        dp[1]=0;
        for (int i = 2; i < dp.length; i++) {
            dp[i]=Math.min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2]);
        }

        return dp[dp.length-1];
    }
}
